Computer Science at Kent Verification of Timed Automata with Deadlines in Uppaal

Timed Automata with Deadlines (TAD) are a form of timed automata that admit a more naturalrepresentation of urgent actions, with the additional advantage of avoiding the most common form oftimelocks. We offer a compositional translation of a practically useful subset of TAD to timed safetyautomata (the well-known variant of timed automata where time progress conditions are expressedby invariants). More precisely, we translate networks of TAD to the modeling language of Uppaal,a state-of-the-art verification tool for timed automata. We also describe an implementation of thistranslation, which allows Uppaal to aid the design and analysis of TAD models.